Determination of burn‐in parameters and residual life for highly reliable products

Today, many products are designed and manufactured to function for a long period of time before they fail. Determining product reliability is a great challenge to manufacturers of highly reliable products with only a relatively short period of time available for internal life testing. In particular, it may be difficult to determine optimal burn‐in parameters and characterize the residual life distribution. A promising alternative is to use data on a quality characteristic (QC) whose degradation over time can be related to product failure. Typically, product failure corresponds to the first passage time of the degradation path beyond a critical value. If degradation paths can be modeled properly, one can predict failure time and determine the life distribution without actually observing failures. In this paper, we first use a Wiener process to describe the continuous degradation path of the quality characteristic of the product. A Wiener process allows nonconstant variance and nonzero correlation among data collected at different time points. We propose a decision rule for classifying a unit as normal or weak, and give an economic model for determining the optimal termination time and other parameters of a burn‐in test. Next, we propose a method for assessing the product's lifetime distribution of the passed units. The proposed methodologies are all based only on the product's initial observed degradation data. Finally, an example of an electronic product, namely contact image scanner (CIS), is used to illustrate the proposed procedure. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Estimating failure time distribution and its parameters based on intermediate data from a Wiener degradation model

Instead of measuring a Wiener degradation or performance process at predetermined time points to track degradation or performance of a product for estimating its lifetime, we propose to obtain the first‐passage times of the process over certain nonfailure thresholds. Based on only these intermediate data, we obtain the uniformly minimum variance unbiased estimator and uniformly most accurate confidence interval for the mean lifetime. For estimating the lifetime distribution function, we propose a modified maximum likelihood estimator and a new estimator and prove that, by increasing the sample size of the intermediate data, these estimators and the above‐mentioned estimator of the mean lifetime can achieve the same levels of accuracy as the estimators assuming one has failure times. Thus, our method of using only intermediate data is useful for highly reliable products when their failure times are difficult to obtain. Furthermore, we show that the proposed new estimator of the lifetime distribution function is more accurate than the standard and modified maximum likelihood estimators. We also obtain approximate confidence intervals for the lifetime distribution function and its percentiles. Finally, we use light‐emitting diodes as an example to illustrate our method and demonstrate how to validate the Wiener assumption during the testing. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

浅析以法律形式控制网络军备竞赛的必要性

网络战是近年来全球军事界相当热的话题,其作为一种全新概念的组织机构,已经开始登上了军事舞台。美国、韩国等国家先后宣布组建网络司令部,引起了全球网络军备竞赛的热潮。文章探讨网络军备竞赛的发展现状和特点,分析以法律形式进行控制的必要性,能够全面系统的了解网络军备竞赛所带来的严重危害,为控制军备竞赛的对策和决策提供一些建议。     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

超声波辅助微波消解预处理测量污泥金属元素

以实验室污泥和污水厂污泥为研究对象,建立了超声波辅助微波消解预处理测量污泥金属元素的方法与程序。首先通过超声波分散污泥絮体,然后对污泥进行加热预处理和微波消除,最后采用火焰原子吸收法测量污泥中的金属元素。结果表明,150 W超声波作用于25 mL污泥3 min为超声波分散污泥的较优条件,能保证后续操作过程取样均匀。微波消解前适宜的加热预处理条件为90℃,20 min。实验室污泥微波消解的较优酸体系为2 mL双氧水＋4 mL反王水（或4 mL王水）;污水厂污泥微波消解的较优酸体系为1 mL氢氟酸＋2 mL双氧水＋4 mL王水,同时,第3阶段消解条件为压强2.0 MPa下消解20 min。超声波辅助微波消解预处理具有用酸量少、简易快捷、准确度和精密度高等优点,测量K,Ca,Mg,Fe的相对标准偏差≤2.75%,加标回收率为97.5%～102%。     

攻击大目标子母弹射击概率的分析与估算

射击概率是子母弹武器效能分析的重要参数,本文以攻击大（线）目标子母弹为对象,提出一种计算命中概率的简便的近似法,计算结果表明该方法计算量小,计算精度工程上可接受;本文还引出了子母弹封锁概率的概念,并作了初步分析。本文结果对子母弹武器论证与设计使用将提供有益的参考。     

MPP Fortran 程序中串行循环的优化

在大规模并行处理系统中,通讯开销是影响程序性能的一个重要因素。本文提出了一种ＭＰＰＦｏｒｔｒａｎ程序中串行循环的优化技术：在串行循环中加入同步控制、将串行循环转换成共享循环。该技术能减少通讯开销、提高程序的性能。     

PAI-CAD/CAM 模型及实现技术研究

本文根据敏捷制造与动态联盟将制造系统空间扩展到全国乃至全球,传统的用于产品开发的ＣＡＤ／ＣＡＭ系统已无法满足动态联盟条件下的产品开发要求,必须开发一种新的ＣＡＤ／ＣＡＭ系统才能满足这一要求。笔者根据国际ＣＡＤ／ＣＡＭ发展趋势,结合我国具体国情,在传统的ＣＡＤ／ＣＡＭ基础上提出了“ＰＡＩ－ＣＡＤ／ＣＡＭ（Ｐｓｅｕｄｏ－ＡｇｉｌｅＩｎｔｅｌｉｇｅｎｔＣＡＤ／ＣＡＭ）”的新概念,并建立了一种系统模型,此外,文章还对系统的实现技术进行了深入的探讨。     

武器系统作战模拟环境的设计与实现

针对当前武器系统作战模拟不易于使用的观状,探讨了建立武器系统作战模拟多媒体表现环境的概念、方法和必要性,从总体上研究了武器系统作战模拟多媒体表观环境的系统结构、功能要求和实现过程。     

微分方程的有界性与概周期解的存在性

本文考虑高维非自治概周期系统ｄｘｄｔ＝ｆ（ｔ,ｘ）,利用对ｘ的分量分组构造Ｌｉａｐｕｎｏｖ函数的方法讨论了其概周期解的存在性。所得结果去掉了文献中系统存在有界解的假设,得到了比较明显的改进。